On Weighted Balls-into-Bins Games
نویسندگان
چکیده
We consider the well-known problem of randomly allocating m balls into n bins. We investigate various properties of single-choice games as well as multiple-choice games in the context of weighted balls. We are particularly interested in questions that are concerned with the distribution of ball weights, and the order in which balls are allocated. Do any of these parameters influence the maximum expected load of any bin, and if yes, then how? The problem of weighted balls is of practical relevance. Balls-intobins games are frequently used to conveniently model load balancing problems. Here, weights can be used to model resource requirements of the jobs, i.e., memory or running time.
منابع مشابه
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bipartite graph with n nodes on each side, we view each node on the left as having balls that it can throw into nodes on the right (bins) to which it is adjacent. If each node on the left throws exactly one ball and each ...
متن کاملBalanced Allocations: Balls-into-Bins Revisited and Chains-into-Bins
The study of balls-into-bins games or occupancy problems has a long history since these processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins game is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this paper ...
متن کاملBalanced offline allocation of weighted balls into bins
We propose a sorting-based greedy algorithm called SortedGreedy[m] for approximately solving the offline version of the d-choice weighted balls-into-bins problem where the number of choices for each ball is equal to the number of bins. We assume the ball weights to be nonnegative. We compare the performance of the sorting-based algorithm with a näıve algorithm called Greedy[m]. We show that by ...
متن کاملThe (1 + β)-Choice Process and Weighted Balls-into-Bins
Suppose m balls are sequentially thrown into n bins where each ball goes into a random bin. It is well-known that the gap between the load of the most loaded bin and the average is Θ( √ m logn n ), for large m. If each ball goes to the lesser loaded of two random bins, this gap dramatically reduces to Θ(log logn) independent of m. Consider now the following “(1 + β)-choice” process for some par...
متن کاملThe 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm
In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of...
متن کامل